Capacity-Equivocation Regions of the DMBCs with Noiseless Feedback
نویسندگان
چکیده
منابع مشابه
Communication with Partial Noiseless Feedback
We introduce the notion of one-way communication schemes with partial noiseless feedback. In this setting, Alice wishes to communicate a message to Bob by using a communication scheme that involves sending a sequence of bits over a channel while receiving feedback bits from Bob for δ fraction of the transmissions. An adversary is allowed to corrupt up to a constant fraction of Alice’s transmiss...
متن کاملThe AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy
To use common randomness in coding is a key idea from the theory of identification. Methods and ideas of this theory are shown here to have also an impact on Shannon’s theory of transmission. As indicated in the title, we determine the capacity for a classical channel with a novel structure of the capacity formula. This channel models a robust search problem in the presence of noise (see R. Ahl...
متن کاملPSPACE hardness of approximating the capacity of Markoff channels with noiseless feedback
It will be proved that approximating the capacity of a Markoff channel with noiseless feedback is PSPACE-hard. By ‘approximating,’ we mean, computing the capacity within a certain given additive error e. A class of channels will be constructed for which it will be proved that approximating the capacity to within 0.1 bits of the correct capacity is PSPACE-hard. To the best of the knowledge of th...
متن کاملMultiple access wiretap channel with noiseless feedback
The physical layer security in the up-link of the wireless communication systems is often modeled as the multiple access wiretap channel (MAC-WT), and recently it has received a lot attention. In this paper, the MAC-WT has been re-visited by considering the situation that the legitimate receiver feeds his received channel output back to the transmitters via two noiseless channels, respectively....
متن کاملCapacity of General Discrete Noiseless Channels
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol weights, it is shown that the capacity—if well-defined—can be determined from the radius of convergence of its generating function, from the smallest positive pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/102069